COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
نویسندگان
چکیده
منابع مشابه
Tameness of The Pseudovariety Ls1
A class of finite semigroups V is said to be decidable if the membership problem for V has a solution, that is, if we can construct an algorithm to test whether a given semigroup lies in V. Decidability of pseudovarieties is not preserved by some of the most common pseudovariety operators, such as semidirect product, Mal’cev product and join [1, 17]. In particular Rhodes [17] has exhibited a de...
متن کاملComplete Reducibility of Pseudovarieties
The notion of reducibility for a pseudovariety has been introduced as an abstract property which may be used to prove decidability results for various pseudovariety constructions. This paper is a survey of recent results establishing this and the stronger property of complete reducibility for specific pseudovarieties.
متن کاملComplete reducibility candidates
Deduction modulo is an extension of first-order predicate logic where axioms are replaced by a congruence relation on propositions and where many theories, such as arithmetic, simple type theory and some variants of set theory, can be expressed. An important question in deduction modulo is to find a condition of the theories that have the strong normalization property. Dowek and Werner have giv...
متن کاملComplete Reducibility and Separability
Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p > 0. A subgroup of G is said to be separable in G if its global and infinitesimal centralizers have the same dimension. We study the interaction between the notion of separability and Serre’s concept of Gcomplete reducibility for subgroups of G. A separability hypothesis appears in many general th...
متن کاملGround Reducibility is EXPTIME-Complete
We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the computations of an alternating Turing machine whose space is polynomially bounded. It is more difficult to show that ground reducibility belongs to DEXPTIME. We associate first an automaton with disequality constraints AR;t to a rewrite system R and a term t. This automaton is d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Algebra and Computation
سال: 2009
ISSN: 0218-1967,1793-6500
DOI: 10.1142/s021819670900507x